Efficient Online Portfolio Selection with Heuristic AI Algorithm
نویسندگان
چکیده
منابع مشابه
Online Portfolio Selection with Group Sparsity
In portfolio selection, it often might be preferable to focus on a few top performing industries/sectors to beat the market. These top performing sectors however might change over time. In this paper, we propose an online portfolio selection algorithm that can take advantage of sector information through the use of a group sparsity inducing regularizer while making lazy updates to the portfolio...
متن کاملDesigning a Portfolio of Parameter Configurations for Online Algorithm Selection
Algorithm portfolios seek to determine an effective set of algorithms that can be used within an algorithm selection framework to solve problems. A limited number of these portfolio studies focus on generating different versions of a target algorithm using different parameter configurations. In this paper, we employ a Design of Experiments (DOE) approach to determine a promising range of values...
متن کاملA Fuzzy Goal Programming Model for Efficient Portfolio Selection.
This paper considers a multi-objective portfolio selection problem imposed by gaining of portfolio, divided yield and risk control in an ambiguous investment environment, in which the return and risk are characterized by probabilistic numbers. Based on the theory of possibility, a new multi-objective portfolio optimization model with gaining of portfolio, divided yield and risk control is propo...
متن کاملAn Online Portfolio Selection Algorithm with Regret Logarithmic in Price Variation
We present a novel efficient algorithm for portfolio selection which theoretically attains two desirable properties: 1. Worst-case guarantee: the algorithm is universal in the sense that it asymptotically performs almost as well as the best constant rebalanced portfolio determined in hindsight from the realized market prices. Furthermore, it attains the tightest known bounds on the regret, or t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2019
ISSN: 2310-5070,2311-004X
DOI: 10.19139/soic.v7i2.484